public class code03 {
//    力扣 150 搜索插入位置
public int searchInsert(int[] nums, int target) {
    int left = 0;
    int right = nums.length - 1;

    // 通过 while 迭代进行计算查看
    while(left <= right) {
        int mid = (left + right) / 2;
        if(nums[mid] == target) {
            return mid;
        } else if(nums[mid] < target) {
            left = mid + 1;
        } else {
            right = mid - 1;
        }
    }
    return left;
}
}
